- deadlock detection
- обнаружение взаимоблокировок, выявление клинчей1) метод, в котором ресурсы предоставляются только в случае, если они доступны
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
deadlock detection
Смотреть что такое "deadlock detection" в других словарях:
Deadlock — This article is about the computer science concept. For other uses, see Deadlock (disambiguation). A deadlock is a situation where in two or more competing actions are each waiting for the other to finish, and thus neither ever does. It is often… … Wikipedia
Deadlock (Star Trek: Voyager) — Deadlock Star Trek: Voyager episode Janeway and her duplicate Episode no. Seas … Wikipedia
Взаимная блокировка — двух процессов P1 и P2 нуждающихся в двух ресурсах. Взаимная блокировка (англ. deadlock) ситуация в многозадачной с … Википедия
Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques … Wikipedia
Distributed lock manager — A distributed lock manager (DLM) provides distributed software applications with a means to synchronize their accesses to shared resources. DLMs have been used as the foundation for several successful clustered file systems, in which the machines … Wikipedia
Wait-for graph — A Wait For Graph in computer science is a directed graph used for deadlock detection in operating systems and relational database systems. In Computer Science, a system that allows concurrent operation of multiple processes and locking of… … Wikipedia
Virgil D. Gligor — Infobox Scientist name = Virgil D. Gligor birth date = Birth date and age|1949|7|28|df=y box width = image width = 100 caption = Virgil D. Gligor, 2007 birth date = birth place = death date = death place = residence = citizenship = nationality =… … Wikipedia
Ostrich algorithm — For other uses, see ostrich (disambiguation). In computer science, the ostrich algorithm is a strategy of ignoring potential problems on the basis that they may be exceedingly rare to stick your head in the sand and pretend that there is no… … Wikipedia
Edge chasing — In computer science, edge chasing is an algorithm for deadlock detection in distributed systems. Whenever a process A is blocked for some resource, a probe message is sent to all processes A may depend on. The probe message contains the process… … Wikipedia
Microsoft SQL Server — Developer(s) Microsoft Stable release SQL Server 2008 R2 (10.50.2500.0 Service Pack 1) / July 11, 2011; 4 months ago … Wikipedia
BoundsChecker — is a memory checking tool used for C++ software development with Microsoft Visual C++. It is part of the [http://www.compuware.com/products/devpartner/visualc.htm DevPartner for Visual C++ BoundsChecker Suite] . Comparable tools are Purify,… … Wikipedia
